Accelerating Revised Simplex Method Using GPU-Based Basis Update
نویسندگان
چکیده
منابع مشابه
Factorization and update of a reduced basis matrix for the revised simplex method
In this paper, we describe a method to enhance the FTRAN and BTRAN operations in the revised simplex algorithm by using a reduced basis matrix defined by basic columns and nonbasic rows. This submatrix of the standard basis matrix is potentially much smaller, but may change its dimension dynamically from iteration to iteration. For the classical product form update (“eta update”), the idea has ...
متن کاملNovel update techniques for the revised simplex method
This paper introduces three novel techniques for updating the invertible representation of the basis matrix when solving practical sparse linear programming (LP) problems using a high performance implementation of the dual revised simplex method, being of particular value when suboptimization is used. Two are variants of the product form update and the other permits multiple Forrest-Tomlin upda...
متن کاملAccelerating Depth Image-Based Rendering Using GPU
In this paper, we propose a practical method for hardwareaccelerated rendering of the depth image-based representation (DIBR) object, which is defined in MPEG-4 Animation Framework eXtension (AFX). The proposed method overcomes the drawbacks of the conventional rendering, i.e. it is slow since it is hardly assisted by graphics hardware and surface lighting is static. Utilizing the new features ...
متن کاملParallelizing the dual revised simplex method
This paper introduces the design and implementation of two parallel dual simplex solvers for general large scale sparse linear programming problems. One approach, called PAMI, extends a relatively unknown pivoting strategy called suboptimization and exploits parallelism across multiple iterations. The other, called SIP, exploits purely single iteration parallelism by overlapping computational c...
متن کاملA Web-Based Decision Support System Using Basis Update on Simplex Type Algorithms
Linear Programming is a significant and well-studied optimization methodology. Simplex type algorithms have been widely used in Decision Support Systems. The computation of the basis inverse is a crucial step in simplex type algorithms. In this paper, we review and compare three basis update methods. We incorporate these methods on the exterior and the revised simplex algorithm in order to high...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2980309